// 162. 寻找峰值
// 中等 https://leetcode.cn/problems/find-peak-element/

#include <bits/stdc++.h>
using namespace std;

int findPeakElement(vector<int>& nums)
{
  int l=0,r=nums.size()-1;
  while(l<r) {
    int mid = (l+r) >> 1;
    if (nums[mid] < nums[mid+1]) {
      l = mid + 1;
    } else {
      r = mid;
    }
  }
  return l;
}

int main(){

}
